Computing Argumentation in Polynomial Number of BDD Operations: A Preliminary Report
نویسندگان
چکیده
Many advances in argumentation theory have been made, but the exponential complexity of argumentation-based reasoning has made it impractical to apply argumentation theory. In this paper, we propose a binary decision diagram (BDD) approach to argumentation-based reasoning. In the approach, sets of arguments and defeats are encoded into BDDs so that an argumentation process can work on a set of arguments and defeats simultaneously in one BDD operation. As a result, the argumentation can be computed in polynomial number of BDD operations on the number of input sentences.
منابع مشابه
Parallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملComputing Vertex PI, Omega and Sadhana Polynomials of F12(2n+1) Fullerenes
The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The vertex PI polynomial is defined as PIv (G) euv nu (e) nv (e). Then Omega polynomial (G,x) for counting qoc strips in G is defined as (G,x) = cm(G,c)xc with m(G,c) being the number of strips of length c. In this paper, a new infinite class of fullerenes is constructed. ...
متن کاملCombinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders
For typical #P-hard problems on graphs, we have recently proposed an approach to solve those problems of moderate size rigorously by means of the binary decision diagram, BDD [12, 13]. This paper extends this approach to counting problems on linear matroids, graphic arrangements and partial orders, most of which are already known to be #P-hard, with using geometric properties. E cient algorithm...
متن کاملExact Path Delay Fault Coverage with Fundamental Zero-Suppressed BDD Operations
1 2 We formulate the path delay fault grading problem as a combinatorial problem that amounts to storing and manipulating sets on a special type of Binary Decision Diagrams (BDD), called zero-suppressed binary decision diagrams (ZBDD). The zero-suppressed BDD is a canonical data structure inherently having the property of representing combinational sets very compactly. A simple modification of ...
متن کاملHardware Acceleration for BDD manipulations
In this paper, in order to accelerate BDD based algorithms, we propose implementing BDD operations by hardware. We have designed a RTL model of the proposed hardware, and expressed it by C language so that we can count the number of clocks needed for each BDD operation. We have examined its performance improvement with respect to the original software library by using several benchmark circuits.
متن کامل